A simpler proof of the four color theorem is presented. The proof was reachedusing a series of equivalent theorems. First the maximum number of edges of aplanar graph is obatined as well as the minimum number of edges for a completegraph. Then it is shown that for the theorem to be false there must exist acomplete planar graph of $h$ edges such that $h>4$. Finally the theorem isproved to be true by showing that there does not exist a complete planar graphwith $h>4$.
展开▼
机译：给出了四色定理的一个简单证明。使用一系列等效定理得出了证明。首先，将平面图的最大边数以及完整图的最小边数设为负。然后表明，对于一个定理为假的定理，必须存在一个完整的$ h $边平面图，使得$ h> 4 $。最后，通过证明不存在带有$ h> 4 $的完整平面图，该定理被证明是正确的。
展开▼
